Background and Objectives: Cryptographic Hash Functions are the linchpins of mobile services, blockchains, and many other technologies. Designing cryptographic Hash Functions has been approached by research communities from the physics, mathematics, computer science, and electrical engineering fields. The emergence of new Hash Functions, new Hash constructions, and new requirements for application-specific Hash Functions, such as the ones of mobile services, have encouraged us to make a comparison of different Hash Functions and propose a new classification.Methods: Over 100 papers were surveyed and reviewed in detail. The research conducted in this paper has included four sections; article selection, detailed review of selected articles, data collection, and evaluation of results. Data were collected as new Hash Function properties, new Hash Function constructions, new Hash Function categories, and existing Hash Function attacks which are used to evaluate the results.Results: This paper surveys seven categories of Hash Functions including block cipher-based Functions, algebraic-based Functions, custom-designed Functions, Memory-hard Functions (MHFs), Physical Unclonable Functions (PUFs), quantum Hash Functions and optical Hash Functions. To the best of our knowledge, the last four mentioned categories have not been sufficiently addressed in most existing surveys. Furthermore, this paper overviews Hash-related adversaries and six Hash construction variants. In addition, we employed the mentioned adversaries as evaluation criteria to illustrate how different categories of Hash Functions withstand the mentioned adversaries. Finally, the surveyed Hash Function categories were evaluated against mobile service requirements.Conclusion: In addition to new classification, our findings suggest using PUFs with polynomial-time error correction or possibly bitwise equivalents of algebraic structures that belongs to post-quantum cryptography as candidates to assist mobile service interaction requirements.